A quantified distributed constraint optimization problem
نویسندگان
چکیده
! " # " # # # $ ! # # % " % # ! ! # # # # " % ! # & % # % # ' % ( ! & # # ! ! ) ! % & ! " % % ! % & ! # % ! # # * # ! # % ! * ! & ) # % ! % ! ! ' # # " # " " ! % & ! % # ! # " % " + % # % ! " + # # # # , ! ( ) + "
منابع مشابه
Distributed Search Methods for Quantified Distributed Constraint Optimiza- tion Problem
Distributed Constraint Optimization problems (DCOPs) have been studied as a fundamental model of multiagent cooperation. In traditional DCOPs, all agents cooperate to optimize the sum of their cost functions. However, in practical systems some agents may desire to select the value of their variables without cooperation. In special cases, such agents may take the values with the worst impact on ...
متن کاملCooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of distributed constraint satisfaction problems (DisCSP) to a quantified DisCSP. A quantified DisCSP includes several universally quantified variables, while all of the variables in a traditional DisCSP are existentially quantified. A universally quantified variable represents a choice of nature or an adversary. A quantified DisCSP formaliz...
متن کاملOptimal Allocation of Distributed Generation in Microgrid by Considering Load Modeling
Recent increment in carbon emission due to the dependency on fossil fuels in power generation sector is a critical issue in the last decade. The motivation to Distributed Generation (DG) in order to catch low carbon networks is rising. This research seeks to experience DG existence in local energy servicing in microgrid structure. Optimal sizing and placement of DG units is followed by this pap...
متن کاملApplying Distributed Constraint Optimization Method to Dynamic Problem
A framework which applies distributed constraint optimization method using depth first search tree to dynamic problem is proposed. The proposed framework is considered as a basic model of multi agent system. The agents communicate with each other to solve the problem. Constraint network for the problem is built. Trees, which are similar to depth first search tree for the constraint network, are...
متن کاملUtilitarian Approach to Privacy in Distributed Constraint Optimization Problems
Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. Here we approach the problem by letting both the optimized costs found in DCOPs and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010